Improving Multicast ACK Tree Construction with the Token Repository Service

نویسنده

  • Christian Maihöfer
چکیده

Many new applications like groupware systems, news and file distribution or audio/video systems are based on multi-cast as a prerequisite for scalability. Many of these applications need the multicast support to be reliable, which is realized in a scalable way by tree based multicast transport protocols, where the receivers are organized in a ACK tree. Tree based approaches raise the problem of setting up and maintaining the ACK tree, which is usually done by variations of the expanding ring search (ERS) approach. In this paper we present an alternative approach for creating ACK trees which is based on the concept of a distributed token repository service. Simulation results show that our approach leads to a lower message overhead than ERS and results in better shaped ACK trees.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Robust and Efficient Mechanism for Constructing Multicast Acknowledgment Trees

A great variety of todays networked applications require a reliable multicast service. A number of the proposed reliable multicast protocols use a positive acknowledgment scheme, which returns ACKs to the sender to confirm correct delivery. To avoid the well-known implosion problem in the case of large receiver groups, often a tree-based approach is used, i.e., receivers are organized in a tree...

متن کامل

Constructing Height-Balanced Multicast Acknowledgment Trees with the Token Repository Service

Many reliable multicast protocols use socalled ACK-trees to avoid the well-known acknowledgment implosion problem in case of large multicast groups. For constructing ACK trees, usually expanding ring search techniques are applied. Our simulation results show that those techniques have scalability problems itself. In this paper, we propose a novel approach for building ACK trees, the token repos...

متن کامل

A robust and efficient mechanism for constructing multicast acknowledgement trees

A great variety of todays networked applications require a reliable multicast service. A number of the proposed reliable multicast protocols use a positive acknowledgment scheme, which returns ACKs to the sender to confirm correct delivery. To avoid the well-known implosion problem in the case of large receiver groups, often a tree-based approach is used, i.e., receivers are organized in a tree...

متن کامل

Building Multicast Acknowledgment Trees

To avoid the well-known implosion problem, the majority of reliable multicast protocols use hierarchical structures to pass acknowledgment messages back to the sender. In most cases, a technique called expanding ring search (ERS) is used to construct the acknowledgment tree. In this paper we analyse ERS by simulation studies. ERS is a simple and fault tolerant approach, but our simulation resul...

متن کامل

Sender-initiated Configuration of an ACK-Tree for Reliable Multicast Transport

Tree-based ACK mechanism for reliable multicast service is well-known to provide high scalability as well as reliability. However, it should be followed an efficient ACK-Tree construction mechanism. The ERS(Expanding Ring Search) mechanism which is a receiver-driven bottom-up approach has been mainly used to construct an ACK-tree. However, it is known to cause heavy message overhead and to have...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000